Sur la régularité de certaines classes de fonctions aléatoires = Regularity of some classes of random functionsFERNIQUE, X.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1988, Vol 307, Num 9, pp 493-496, issn 0764-4442Article

On the complexity of finite random functions = Sur la complexité des fonctions aléatoires finiesFEIGE, U.Information processing letters. 1992, Vol 44, Num 6, pp 295-296, issn 0020-0190Article

Fonctions aléatoires à valeurs dans certains espaces nucléaires = Random functions taking their values in certain nuclear spacesFERNIQUE, X.Probability theory and related fields. 1989, Vol 83, Num 1-2, pp 87-99, issn 0178-8051, 13 p.Article

On a class of the universally integrable random functionsSEKIGUCHI, T; SHIOTA, Y.Tohoku Mathematical Journal. 1986, Vol 38, Num 3, pp 357-364, issn 0040-8735Article

Efficient construction of (distributed) verifiable random functionsDODIS, Yevgeniy.Lecture notes in computer science. 2002, pp 1-17, issn 0302-9743, isbn 3-540-00324-X, 17 p.Conference Paper

Oscillations de fonctions aléatoires gaussiennes à valeurs vectorielles = Oscillations of vector-valued gaussian random functionsFERNIQUE, X.Mathematica scandinavica. 1987, Vol 60, Num 1, pp 96-108, issn 0025-5521Article

Images and preimages in random mappingsDRMOTA, M; SORIA, M.SIAM journal on discrete mathematics (Print). 1997, Vol 10, Num 2, pp 246-269, issn 0895-4801Article

Random modulation cw lidar using new random sequenceNAGASAWA, C; ABO, M; YAMAMOTO, H et al.Applied optics. 1990, Vol 29, Num 10, pp 1466-1470, issn 0003-6935Article

A simple and unified method of proving indistinguishabilityNANDI, Mridul.Lecture notes in computer science. 2006, pp 317-334, issn 0302-9743, isbn 3-540-49767-6, 1Vol, 18 p.Conference Paper

The transferable belief model and random setsSMETS, P.International journal of intelligent systems. 1992, Vol 7, Num 1, pp 37-46, issn 0884-8173Article

Indistinguishability of random systemsMAURER, Ueli.Lecture notes in computer science. 2002, pp 110-132, issn 0302-9743, isbn 3-540-43553-0Conference Paper

On the strength of simply-iterated Feistel ciphers with whitening keysONIONS, Paul.Lecture notes in computer science. 2001, pp 63-69, issn 0302-9743, isbn 3-540-41898-9Conference Paper

How to stretch random functions : The security of protected counter sumsBERNSTEIN, D. J.Journal of cryptology. 1999, Vol 12, Num 3, pp 185-192, issn 0933-2790Article

Measurement uncertainty: a probabilistic theory for intensive entitiesMICHELINI, R. C; ROSSI, G. B.Measurement. 1995, Vol 15, Num 3, pp 143-157, issn 0263-2241Article

Zeros of random polynomials over finite fieldsODONI, R. W. K.Mathematical proceedings of the Cambridge Philosophical Society. 1992, Vol 111, Num 2, pp 193-197, issn 0305-0041Article

Shuffling arrays : appearances may be deceivingCASTELLAN, N. J.Behavior research methods, instruments & computers. 1992, Vol 24, Num 1, pp 72-77, issn 0743-3808Article

Stochastische Analoga des Satzes von Stone-WeierstrassSTARKLOFF, H.-J.Wissenschaftliche Zeitschrift der Technischen Universität Karl-Marx-Stadt/Chemnitz. 1991, Vol 33, Num 1, pp 123-127Article

The convex hull of the zeros of a random polynomialGLENDINNING, R.Journal of statistical computation and simulation (Print). 1989, Vol 31, Num 2, pp 111-118, issn 0094-9655, 8 p.Article

Concentration inequalitiesBOUCHERON, Stéphane; LUGOSI, Gabor; BOUSQUET, Olivier et al.Lecture notes in computer science. 2004, pp 208-240, issn 0302-9743, isbn 3-540-23122-6, 33 p.Conference Paper

On the unpredictability of bits of the Elliptic Curve Diffie-Hellman schemeBONEH, Dan; SHPARLINSKI, Igor E.Lecture notes in computer science. 2001, pp 201-212, issn 0302-9743, isbn 3-540-42456-3Conference Paper

Breaking generalized Diffie-Hellman modulo a composite is no easier than factoringBIHAM, E; BONEH, D; REINGOLD, O et al.Information processing letters. 1999, Vol 70, Num 2, pp 83-87, issn 0020-0190Article

The almost equivalence of pairwise and mutual independence and the duality with exchangeabilityYENENG SUN.Probability theory and related fields. 1998, Vol 112, Num 3, pp 425-456, issn 0178-8051Article

Boolean random functionsSERRA, J.Journal of microscopy (Print). 1989, Vol 156, Num 1, pp 41-63, issn 0022-2720, 23 p.Article

Sur les distributions limites des polynômes symétriques aléatoiresSEJDL, L.Teoriâ verojatnostej i eë primeneniâ. 1988, Vol 33, Num 2, pp 266-278, issn 0040-361XArticle

An e-lottery scheme using verifiable random functionCHOW, Sherman S. M; HUI, Lucas C. K; YIU, S. M et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part III, 651-660Conference Paper